H-minimal Graphs of Low Regularity in H1
نویسنده
چکیده
In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C H-minimal graphs whose components of the unit horizontal Gauss map are in W 1,1 are ruled surfaces with C seed curves. In a different direction, we investigate ways in which patches of C H-minimal graphs can be glued together to form continuous piecewise C Hminimal surfaces. We apply these description of H-minimal graphs to the question of the existence of smooth solutions to the Dirichlet problem with smooth data. We find a necessary condition for the existence of smooth solutions and produce examples where the conditions are satisfied and where they fail. In particular we illustrate the failure of the smoothness of the data to force smoothness of the solution to the Dirichlet problem by producing a class of smooth curves whoses H-minimal spanning graphs cannot be C.
منابع مشابه
Obstructions to the Existence of Smooth Solutions to the Plateau Problem in H1
In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C H-minimal graphs are ruled surfaces with C seed curves. Moreover, in light of a structure theorem of Franchi, Serapioni and Serra Cassano, we see that any H-minimal surface is, up to a set of perimeter zero, composed of such pieces. Along these lines, we investigate ways in which patches of C H-m...
متن کاملH - Minimal Graphs of Low Regularity
In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C H-minimal graphs are ruled surfaces with C seed curves. Moreover, in light of a structure theorem of Franchi, Serapioni and Serra Cassano, we see that any H-minimal surface is, up to a set of perimeter zero, composed of such pieces. Along these lines, we investigate ways in which patches of C H-m...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006